Average Frobenius distribution for elliptic curves defined over finite
نویسنده
چکیده
Let K be a fixed number field, assumed to be Galois over Q. Let r and f be fixed integers with f positive. Given an elliptic curve E , defined over K , we consider the problem of counting the number of degree f prime ideals of K with trace of Frobenius equal to r . Except in the case f = 2, we show that ‘on average,’ the number of such prime ideals with norm less than or equal to x satisfies an asymptotic identity that is in accordance with standard heuristics. This work is related to the classical Lang–Trotter conjecture and extends the work of several authors.
منابع مشابه
Average Frobenius Distribution for Elliptic Curves Defined over Finite Galois Extensions of the Rationals
Let K be a fixed number field, assumed to be Galois over Q. Let r and f be fixed integers with f positive. Given an elliptic curve E, defined over K, we consider the problem of counting the number of degree f prime ideals of K with trace of Frobenius equal to r. Except in the case f = 2, we show that “on average,” the number of such prime ideals with norm less than or equal to x satisfies an as...
متن کاملAverage Frobenius Distributions for Elliptic Curves over Abelian Extensions
Let E be an elliptic curve defined over an abelian number field K of degree m. For a prime ideal p of OK of good reduction we consider E over the finite field OK/p and let ap(E) be the trace of the Frobenius morphism. If E does not have complex multiplication, a generalization of the Lang-Trotter Conjecture asserts that given r, f ∈ Z with f > 0 and f | m, there exists a constant CE,r,f ≥ 0 suc...
متن کاملFrobenius distribution for elliptic curves defined over finite
Let K be a fixed number field, assumed to be Galois over Q. Let r and f be fixed integers with f positive. Given an elliptic curve E , defined over K , we consider the problem of counting the number of degree f prime ideals of K with trace of Frobenius equal to r . Except in the case f = 2, we show that ‘on average,’ the number of such prime ideals with norm less than or equal to x satisfies an...
متن کاملTwo Efficient Algorithms for Arithmetic of Elliptic Curves Using Frobenius Map
In this paper, we present two efficient algorithms computing scalar multiplications of a point in an elliptic curve defined over a small finite field, the Frobenius map of which has small trace. Both methods use the identity which expresses multiplication-by-m maps by polynomials of Frobenius maps. Both are applicable for a large family of elliptic curves and more efficient than any other metho...
متن کاملFast Computation Methods for Scalar Multiplication on Elliptic Curves Defined over Higher Characteristic Finite Field
In this paper, we propose three algorithms to perform scalar multiplication on elliptic curves defined over higher characteristic finite fields such as the OEF (Optimal Extension Field). First, we propose an efficient scalar multiplication method in which the Frobenius expansion is used on an elliptic curve defined over OEF. Second, we propose a new finite field multiplication algorithm. Third,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011